A Cointuitionistic Adjoint Logic

نویسندگان

  • Harley Eades
  • Gianluigi Bellin
چکیده

Bi-intuitionistic logic (BINT) is a conservative extension of intuitionistic logic to include the duals of each logical connective. One leading question with respect to BINT is, what does BINT look like across the three arcs – logic, typed λ-calculi, and category theory – of the Curry-HowardLambek correspondence? Categorically, BINT can be seen as a mixing of two worlds: the first being intuitionistic logic (IL), which is modeled by a cartesian closed category, and the second being the dual to intuitionistic logic called cointuitionistic logic (coIL), which is modeled by a cocartesian coclosed category. Crolard [11] showed that combining these two categories into the same category results in it degenerating to a poset. However, this degeneration does not occur when both logics are linear. We propose that IL and coIL need to be separated, and then mixed in a controlled way using the modalities from linear logic. This separation can be ultimately achieved by an adjoint formalization of bi-intuitionistic logic. This formalization consists of three worlds instead of two: the first is intuitionistic logic, the second is linear bi-intuitionistic (Bi-ILL), and the third is cointuitionistic logic. They are then related via two adjunctions. The adjunction between IL and ILL is known as a Linear/Non-linear model (LNL model) of ILL, and is due to Benton [4]. However, the dual to LNL models which would amount to the adjunction between coILL and coIL has yet to appear in the literature. In this paper we fill this gap by studying the dual to LNL models which we call dual LNL models. We conduct a similar analysis to that of Benton for dual LNL models by showing that dual LNL models correspond to dual linear categories, the dual to Bierman’s [5] linear categories proposed by Bellin [3]. Following this we give the definition of bi-LNL models by combining our dual LNL models with Benton’s LNL models to obtain a categorical model of bi-intuitionistic logic, but we leave its analysis and corresponding logic to a future paper. Finally, we give a corresponding sequent calculus, natural deduction, and term assignment for dual LNL models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A pragmatic framework for intuitionistic modalities: Classical logic and Lax logic

We reconsider Dalla Pozza and Garola pragmatic interpretation of intuitionistic logic [13] where sentences and proofs formalize assertions and their justifications and revise it so that the costruction is done within an intuitionistic metatheory. We reconsider also the extension of Dalla Pozza and Garola’a approach to cointuitionistic logic, seen as a logic of hypotheses [5, 9, 4] and the duali...

متن کامل

Multi-Adjoint Logic Programming

A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approa...

متن کامل

Revisiting Reductants in the Multi-adjoint Logic Programming Framework

Reductants are a special kind of fuzzy rules which constitute an essential theoretical tool for proving correctness properties. A multi-adjoint logic program, when interpreted on an arbitrary lattice, has to include all its reductants in order to preserve the approximate completeness property. In this work, after revisiting the different notions of reductant arisen in the framework of multi-adj...

متن کامل

Biresiduated Multi-Adjoint Logic Programming

Multi-adjoint logic programs were recently proposed as a generalisation of monotonic and residuated logic programs introduced, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the possible existence of biresiduated pairs is considered, later, on the resulting framework of biresiduated multi-adjoint logic progra...

متن کامل

Multi-adjoint Logic Programming with Continuous Semantics

Considering different implication operators, such as Lukasiewicz, Gödel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truthvalues. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1708.05896  شماره 

صفحات  -

تاریخ انتشار 2017